Complexity of Probabilistic Inference in Random Dichotomous Hedonic Games

Hedonic games model cooperative where agents desire to form coalitions, and only care about the composition of coalitions which they are members. Focusing on various classes dichotomous hedonic games, each agent either approves or disapproves a given coalition, we propose random extension, players have an independent participation probability. We initiate research computational complexity computing probability that partitions optimal stable. While some cases admit efficient algorithms (e.g., approve few coalitions), become computationally hard (#P-hard) in their complementary scenario. then investigate distribution perfect performance majority is friends with its When friendships independently constant probability, prove number size 3 converges Poisson variable.